Stable under specialization sets and cofiniteness
نویسندگان
چکیده
منابع مشابه
Stable sets and polynomials
Several applications of methods from non-linear algebra to the stable set problem in graphs are surveyed. The most recent work sketched is joint with A. Schrijver and involves non-linear inequalities. These yield a procedure to generate facets of the stable set polytope. If a class of graphs has the property that all facets of the stable set polytope can be generated this way in a bounded numbe...
متن کاملNéron-severi Groups under Specialization
André used Hodge-theoretic methods to show that in a smooth proper family X → B of varieties over an algebraically closed field k of characteristic 0, there exists a closed fiber having the same Picard number as the geometric generic fiber, even if k is countable. We give a completely different approach to André’s theorem, which also proves the following refinement: in a family of varieties wit...
متن کاملII. Stable sets and colourings
We have seen that in any graph G = (V,E), a maximum-size matching can be found in polynomial time. This means that α(L(G)) can be found in polynomial time, where L(G) is the line graph of G.2 On the other hand, it is NP-complete to find a maximum-size stable set in a graph. That is, determining α(G) is NP-complete. Since α(G) = |V |−τ(G) and α(G) = ω(G), also determining the vertex cover number...
متن کاملII. Stable sets and colourings
We have seen that in any graph G = (V, E), a maximum-size matching can be found in polynomial time. This means that α(L(G)) can be found in polynomial time, where L(G) is the line graph of G.2 On the other hand, it is NP-complete to find a maximum-size stable set in a graph. That is, determining α(G) is NP-complete. Since α(G) = |V |−τ(G) and α(G) = ω(G), also determining the vertex cover numbe...
متن کاملEpistemically Stable Strategy Sets
This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2019
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s0219498819500154